The Density Advantage of Configurable Computing

نویسنده

  • André DeHon
چکیده

A large and growing community of researchers has successfully used fieldprogrammable gate arrays (FPGAs) to accelerate computing applications. The absolute performance achieved by these configurable machines has been impressive—often one to two orders of magnitude greater than processor-based alternatives. Configurable computers have proved themselves the fastest or most economical way to solve problems such as the following:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A development environment for configurable computing

As FPGA density increases, so does the potential for configurable computing machines. Unfortunately, the larger designs which take advantage of the higher densities require much more effort and longer design cycles, making it even less likely to appeal to users outside the field of configurable computing. To combat this problem, we present the Reconfigurable Computing Application Development En...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Reconfigurable Computing I: Motivation and Concepts

This lecture introduces reconfigurable computing and the field-programmable gate array (FPGA) by discussing the density advantage of configurable computing and some of the trade offs involved in designing and FPGA. Some important conclusions were that wiring and routing area dominate total area, three and four input lookup tables are ideal for area efficiency, five and six input lookup tables a...

متن کامل

New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

In this paper, a new  algorithm for computing secondary invariants of  invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants.  The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...

متن کامل

Video Image Processing with the Sonic Architecture

C urrent industrial videoprocessing systems use a mixture of high-performance workstations and application-specific integrated circuits. However, video image processing in the professional broadcast environment requires more computational power and data throughput than most of today’s general-purpose computers can provide. In addition, using ASICs for video image processing is both inflexible a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Computer

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2000